A note on the length of maximal arithmetic progressions in random subsets

نویسندگان

  • Y. Shang
  • Yilun Shang
چکیده

Let U (n) denote the maximal length arithmetic progression in a non-uniform random subset of {0, 1} n , where 1 appears with probability pn. By using dependency graph and Stein-Chen method, we show that U (n) − cn ln n converges in law to an extreme type distribution with ln pn = −2/cn. Similar result holds for W (n) , the maximal length aperiodic arithmetic progression (mod n). An arithmetic progression is a sequence of numbers such that the difference of any two successive members of the sequence is a constant. A celebrated result of Szemerédi [5] says that any subset of integers of positive upper density contains arbitrarily long arithmetic progressions. The recent work [6] reviews some extremal problems closely related with arithmetic progressions and prime sequences, under the name of the Erdös-Turán conjectures, which are known to be notoriously difficult to solve. Let ξ 1 , ξ 2 , · · · , ξ n be a uniformly chosen random word in {0, 1} n and Ξ n be the random set consisting elements i such that ξ i = 1. Benjamini et al. [3] studies the length of maximal arithmetic progressions in Ξ n. Denote by U (n) the maximal length arithmetic progression in Ξ n and W (n) the maximal length aperiodic arithmetic progression (mod n) in Ξ n. They show, among others, that the expectation of U (n) and W (n) is roughly 2 ln n/ ln 2. In view of the random graph theory [4], a natural extension of [3] is to consider non-uniform random subset of {0, 1} n , which is the main interest of this note. Let ξ i = 1 with probability p n and ξ i = 0 with probability 1 − p n , where p n ∈ [0, 1] is a function of n. Following [3], the key to our work is to construct proper dependency graph and apply the Stein-Chen method of Poisson approximation (see e.g. [1,4]). Our result implies that, in the non-uniform scenarios, the expectation of U (n) and W (n) is roughly c n ln n, with ln p n = −2/c n. Obviously, taking p n ≡ 1/2 and c n ≡ 2/ ln 2, we then recover the main result of Benjamini et al. The rest of the note is organized as follows. We present the main results in Section …

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximal Arithmetic Progressions in Random Subsets

Let U (N) denote the maximal length of arithmetic progressions in a random uniform subset of {0, 1}N . By an application of the Chen-Stein method, we show that U −2 log N/ log 2 converges in law to an extreme type (asymmetric) distribution. The same result holds for the maximal length W (N) of arithmetic progressions (mod N). When considered in the natural way on a common probability space, we ...

متن کامل

On the maximal length of arithmetic progressions∗

This paper is a continuation of Benjamini, Yadin and Zeitouni’s paper [4] on maximal arithmetic progressions in random subsets. In this paper the asymptotic distributions of the maximal arithmetic progressions and arithmetic progressions modulo n relative to an independent Bernoulli sequence with parameter p are given. The errors are estimated by using the Chen-Stein method. Then the almost sur...

متن کامل

Forbidden arithmetic progressions in permutations of subsets of the integers

Permutations of the positive integers avoiding arithmetic progressions of length 5 were constructed in (Davis et al, 1977), implying the existence of permutations of the integers avoiding arithmetic progressions of length 7. We construct a permutation of the integers avoiding arithmetic progressions of length 6. We also prove a lower bound of 1 2 on the lower density of subsets of positive inte...

متن کامل

On rainbow 4-term arithmetic progressions

{sl Let $[n]={1,dots, n}$ be colored in $k$ colors. A rainbow AP$(k)$ in $[n]$ is a $k$ term arithmetic progression whose elements have different colors. Conlon, Jungi'{c} and Radoiv{c}i'{c} cite{conlon} prove that there exists an equinumerous 4-coloring of $[4n]$ which is rainbow AP(4) free, when $n$ is even. Based on their construction, we show that such a coloring of $[4n]$...

متن کامل

ON DISTRIBUTION OF THREE-TERM ARITHMETIC PROGRESSIONS IN SPARSE SUBSETS OF Fp

We prove a version of Szemerédi’s regularity lemma for subsets of a typical random set in F p . As an application, a result on the distribution of three-term arithmetic progressions in sparse sets is discussed.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014